It is because unordered maps are implemented using hashing techniques while our ordered maps are based on self balancing trees which has a insertion and deletion time complexity of O(logn) while in hashing it is O(1) here they have discussed much more in detail comparison between maps and unordered maps.